Identifying Redundant Flow Limits on Parallel Lines
نویسندگان
چکیده
منابع مشابه
Identifying Redundant Test Cases for Testing Parallel Language Constructs
Based on the successes of others in utilizing parallelism to enhance the performance of communication protocol implementations, we have been investigating various approaches to exploiting parallelism to improve the performance of implementations of the MIL-STD 188-220A protocol standard. Simultaneously, we have been investigating ways of providing automatic testing of the parallel aspects of th...
متن کاملSensory Redundant Parallel Mobile Mechanism
This paper presents a novel design for a mobile robot based on the kinematics of parallel mechanisms. The robot consists of 3 legs, each equipped with an asynchronous driving unit. The legs are connected to the driving units with spherical joints and to the upper plate with a revolute joint. Three additional encoders, attached to the upper revolute joints provide redundant data. This data is us...
متن کاملRedundant Actuation of Parallel Manipulators
High stiffness, low inertia, large accelerations, and high precision are desirable properties attributed to parallel kinematics machines (PKM). However, relatively small workspace and the abundance of singularities within the workspace partly annihilate the aforementioned advantages. Redundant actuation and novel redundant kinematics are means to tackle these shortcomings. Redundant parallel ki...
متن کاملFinite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups
This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage....
متن کاملOn Identifying Strongly Connected Components in Parallel
The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm for this problem which has signi cantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expected serial running time of our algorithm to be O(n log n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2018
ISSN: 0885-8950,1558-0679
DOI: 10.1109/tpwrs.2018.2816807